全文获取类型
收费全文 | 71655篇 |
免费 | 13725篇 |
国内免费 | 9456篇 |
专业分类
电工技术 | 8461篇 |
技术理论 | 1篇 |
综合类 | 9125篇 |
化学工业 | 1398篇 |
金属工艺 | 1275篇 |
机械仪表 | 5407篇 |
建筑科学 | 1290篇 |
矿业工程 | 966篇 |
能源动力 | 1406篇 |
轻工业 | 685篇 |
水利工程 | 1120篇 |
石油天然气 | 798篇 |
武器工业 | 1263篇 |
无线电 | 12627篇 |
一般工业技术 | 4534篇 |
冶金工业 | 690篇 |
原子能技术 | 272篇 |
自动化技术 | 43518篇 |
出版年
2024年 | 236篇 |
2023年 | 1232篇 |
2022年 | 2429篇 |
2021年 | 2634篇 |
2020年 | 2937篇 |
2019年 | 2488篇 |
2018年 | 2440篇 |
2017年 | 2932篇 |
2016年 | 3375篇 |
2015年 | 4054篇 |
2014年 | 5216篇 |
2013年 | 5103篇 |
2012年 | 6304篇 |
2011年 | 6570篇 |
2010年 | 5325篇 |
2009年 | 5495篇 |
2008年 | 5844篇 |
2007年 | 6235篇 |
2006年 | 4875篇 |
2005年 | 4036篇 |
2004年 | 3222篇 |
2003年 | 2548篇 |
2002年 | 1912篇 |
2001年 | 1504篇 |
2000年 | 1258篇 |
1999年 | 948篇 |
1998年 | 758篇 |
1997年 | 608篇 |
1996年 | 470篇 |
1995年 | 346篇 |
1994年 | 293篇 |
1993年 | 228篇 |
1992年 | 214篇 |
1991年 | 109篇 |
1990年 | 137篇 |
1989年 | 99篇 |
1988年 | 70篇 |
1987年 | 27篇 |
1986年 | 39篇 |
1985年 | 39篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 38篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach. 相似文献
92.
Here a new model of Traveling Salesman Problem (TSP) with uncertain parameters is formulated and solved using a hybrid algorithm. For this TSP, there are some fixed number of cities and the costs and time durations for traveling from one city to another are known. Here a Traveling Salesman (TS) visits and spends some time in each city for selling the company’s product. The return and expenditure at each city are dependent on the time spent by the TS at that city and these are given in functional forms of t. The total time limit for the entire tour is fixed and known. Now, the problem for the TS is to identify a tour program and also to determine the stay time at each city so that total profit out of the system is maximum. Here the model is solved by a hybrid method combining the Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). The problem is divided into two subproblems where ACO and PSO are used successively iteratively in a generation using one’s result for the other. Numerical experiments are performed to illustrate the models. Some behavioral studies of the models and convergences of the proposed hybrid algorithm with respect to iteration numbers and cost matrix sizes are presented. 相似文献
93.
Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance. 相似文献
94.
Fresh and frozen-thawed (F-T) pork meats were classified by Vis–NIR hyperspectral imaging. Eight optimal wavelengths (624, 673, 460, 588, 583, 448, 552 and 609 nm) were selected by successive projections algorithm (SPA). The first three principal components (PCs) obtained by principal component analysis (PCA) accounted for over 99.98% of variance. Gray-level-gradient co-occurrence matrix (GLGCM) was applied to extract 45 textural features from the PC images. The correct classification rate (CCR) was employed to evaluate the performance of the partial least squares-discriminate analysis (PLS-DA) models, by using (A) the reflected spectra at full wavelengths and (B) those at the optimal wavelengths, (C) the extracted textures based on the PC images, and (D) the fused variables combining spectra at the optimal wavelengths and textures. The results showed that the best CCR of 97.73% was achieved by applying (D), confirming the high potential of textures for fresh and F-T meat discrimination. 相似文献
95.
Wireless sensor networks are generally composed of a large number of hardware devices of the same type, deployed over a region of interest in order to perform a monitoring activity on a set of target points. Nowadays, several different types of sensor devices exist, which are able to monitor different aspects of the region of interest (including sound, vibrations, proximity, chemical contaminants, among others) and may be deployed together in a heterogeneous network. In this work, we face the problem of maximizing the amount of time during which such a network can remain operational, while maintaining at all times a minimum coverage guarantee for all the different sensor types. Some global regularity conditions in order to guarantee a fair level of coverage for each sensor type to each target are also taken into account in a second variant of the proposed problem. For both problem variants we developed an exact approach, which is based on a column generation algorithm whose subproblem is either solved heuristically by means of a genetic algorithm or optimally by an appropriate ILP formulation. In our computational tests the proposed genetic algorithm is shown to be able to dramatically speed up the procedure, enabling the resolution of large-scale instances within reasonable computational times. 相似文献
96.
In cloud storage systems, more than 50% of requests are metadata operations, and thus the file system metadata search performance has become increasingly important to different users. With the rapid growth of storage system scales in volume, traditional full-size index trees cannot offer high-performance metadata search due to hierarchical indexing bottleneck. In order to alleviate the long latency and improve the quality-of-service (QoS) in cloud storage service, we proposed a novel provenance based metadata-search system, called PROMES. The metadata search in PROMES is split into three phases: (i) leveraging correlation-aware metadata index tree to identify several files as seeds, most of which can satisfy the query requests, (ii) using the seeds to find the remaining query results via relationship graph search, (iii) continuing to refine and rerank the whole search results, and sending the final results to users. PROMES has the salient features of high query accuracy and low latency, due to files’ tight and lightweight indexing in relationship graph coming from provenance’s analysis. Compared with state-of-the-art metadata searching schemes, PROMES demonstrates its efficiency and efficacy in terms of query accuracy and response latency. 相似文献
97.
We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood–Halton–Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic. 相似文献
98.
Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality. 相似文献
99.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
100.
This paper presents an adaptive backstepping-based multilevel approach for the first time to control nonlinear interconnected systems with unknown parameters. The system consists of a nonlinear controller at the first level to neutralize the interaction terms, and some adaptive controllers at the second level, in which the gains are optimally tuned using genetic algorithm. The presented scheme can be used in systems with strong couplings where completely ignoring the interactions leads to problems in performance or stability. In order to test the suitability of the method, two case studies are provided: the uncertain double and triple coupled inverted pendulums connected by springs with unknown parameters. The simulation results show that the method is capable of controlling the system effectively, in both regulation and tracking tasks. 相似文献